2D1431 Machine Learning Lab 1: Concept Learning & Decision Trees
نویسندگان
چکیده
You have to prepare the solutions to the lab assignments prior to the scheduled labs, which are mainly for examination. In order to pass the lab you present your program and answers to the question to the assistent. Labs can be presented in groups of two, however both students need to fully understand the entire solution and answers. It is also assumed that you complete the assignment on your own and do not use parts of someone else’s code or solution. Violation of these rules may result in failing the entire course. Before you start this lab you should be familiar with programming in MATLAB. In particular you should understand howMATLAB performs matrix computations, simple graphics, simple programming constructs, functions and the help system in MATLAB. If you want to learn MATLAB or refresh your knowledge I recommend that you carefully study the online guide Practical Introduction to MATLAB (S.Gockenback, 1999) and the MATLAB Primer (Sigmon, 1993) to which you find links on the course webpage. In this lab you will use some predefined functions for building decision trees and analyzing their performance, but you will also have to program some computations yourself. During the examination with the lab assistent, you will not only present your results but also the code that you wrote. It is assumed that you are familiar with the basic concepts of decision trees and that you have read chapters 2 and 3 on concept learning and decision trees in the course book Machine Learning (Mitchell, 1997).
منابع مشابه
2D1431 Machine Learning Lab 4: Reinforcement Learning
In this lab you will learn about dynamic programming and reinforcement learning. It is assumed that you are familiar with the basic concepts of reinforcement learning and that you have read chapter 13 in the course book Machine Learning (Mitchell, 1997). The first four chapters of the survey on reinforcement learning by Kaelbling et al. (1996) is a good supplementary material. For further readi...
متن کامل2D1431 Machine Learning Lab 3: Reinforcement Learning
In this lab you will learn about dynamic programming and reinforcement learning. It is assumed that you are familiar with the basic concepts of reinforcement learning and that you have read chapter 13 in the course bookMachine Learning (Mitchell, 1997). The first four chapters of the survey on reinforcement learning by Kaelbling et al. (1996) is a good supplementary material. For further readin...
متن کاملدستهبندی دادههای دوردهای با ابرمستطیل موازی محورهای مختصات
One of the machine learning tasks is supervised learning. In supervised learning we infer a function from labeled training data. The goal of supervised learning algorithms is learning a good hypothesis that minimizes the sum of the errors. A wide range of supervised algorithms is available such as decision tress, SVM, and KNN methods. In this paper we focus on decision tree algorithms. When we ...
متن کامل2d1431 Machine Learning Lab 3: Instance Based Learning & Neural Networks
In this lab you will learn about instance based learning algorithm (locally weighted regression) and artificial neural networks and apply both techniques to function approximation. You will also learn how to use crossvalidation for parameter and feature selection. You will have to implement the code for locally weighted regression and cross-validation. You will use some existing code for the ba...
متن کاملExtracting Decision Trees from Interval Pattern Concept Lattices
Formal Concept Analysis (FCA) and concept lattices have shown their effectiveness for binary clustering and concept learning. Moreover, several links between FCA and unsupervised data mining tasks such as itemset mining and association rules extraction have been emphasized. Several works also studied FCA in a supervised framework, showing that popular machine learning tools such as decision tre...
متن کامل